火炮射表数据处理计算步骤和程序框图

本文是文献［１—３］的继续,主要研究火炮射表数据处理算法的计算步骤和程序设计框图。这两个内容是正确进行程序设计、分析和使用的重要环节。     

反坦克导弹的气动参数辨识

本文运用极大似然法进行激光驾束制导反坦克导弹气动参数的辨识。在辨识的迭代寻优过程中,采用变步长搜索提高辨识准度;在辨识算法的具体计算处理上,采用了模型分解法,大大减少了计算时间,保证了气动参数的辨识精度。同时给出辨识仿真验证结果.     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

Military expenditure and income distribution in South Korea

This paper attempts to investigate the long-run and the causal relationship between military expenditure and income distribution in South Korea for the period 1965–2011. Applying the bounds test approach to cointegration, we found a long-run relationship between military expenditure and the Gini coefficient with military expenditure having a positive and a statistically significant impact on income inequality. A 1% rise in military expenditure increased the Gini coefficient by 0.38%. Application of the lag-augmented causality test also reveals a unidirectional causality running from military expenditure to income inequality. The evidence seems to suggest that devoting more resources to the military sector may further worsen income inequality in South Korea.     

顾及噪声影响的GNSS高程序列预测Prophet方法

全球导航卫星系统(global navigation satellite system, GNSS)高程时间序列具有非平稳、非线性、含噪声等特点,在深入研究Prophet预测模型的基础上,针对Prophet预测模型对于趋势信号和周期信号有良好预测效果这一特性,提出一种引入经验模态分解(empirical mode decomposition, EMD)的“降噪—分解—预测”组合GNSS高程时间序列预测方法。该方法先将原始时间序列进行EMD降噪,再对降噪后的序列进行分解预测,最后重构各分量预测信号为最终预测序列。通过对实测高程数据进行研究,实验结果表明：降噪后信号的平均信噪比为10.30dB,能量百分比平均为88.75%;利用所构建的短期预测方法,GNSS高程时间序列预测结果的均方根误差分别平均提升26.41%和14.88%;平均百分比误差分别平均提升18.92%和7.91%,验证了组合预测方法的有效性及实用性。     

结合振动特征优选和GWOA-XGBoost的电机轴承故障诊断

为解决电机轴承故障状态难以识别,从而造成诊断精度不高的情况,提出了一种基于信号特征提取与极限梯度提升算法(extreme gradient boosting, XGBoost)结合的电机轴承故障诊断模型。使用优化的变分模态分解获得振动信号的固有模态函数(intrinsic mode function, IMF)分量,再基于多尺度熵理论计算各IMF分量的多尺度熵值进行特征重构。在鲸鱼优化算法(whale optimization algorithm, WOA)中引入遗传算法的选择、交叉、变异操作对WOA进行改进。用改进的WOA算法对XGBoost的超参数进行寻优,获得了帮助XGBoost取得最优分类效果的超参数组合,将7种不同故障类型的振动信号进行重构后输入优化的XGBoost模型进行故障诊断。实验结果表明,所提GWOA-XGBoost模型的电机轴承故障诊断精度能够达到97.14%,相较于传统诊断方法,性能提升效果显著。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

用线性规划法设计复系数FIR滤波器

讨论了在复Chebyshev逼近意义下设计复系数FIR滤波器问题。直接把复Chebyshev逼近问题离散化成有限维线性规划问题 ,再用单纯形法求解这种方法一直被认为只能设计实系数滤波器 ,而且计算量大、收敛速度慢。本文从直接离散化出发 ,推导出一种求解此问题的改进的单纯形算法 ,适用于设计复系数滤波器 ,极大地减小了计算量 ,提高了收敛速度。并证明了它与通过求解半无限线性规划的对偶问题而得到的改进的单纯形法是等价的。最后给出了算法的仿真结果     

一种新的时频分析方法

首先分析了传统时频分析方法的特点及其局限性,而后评述了一种最新的适用于非平稳、非线性信号的通用的时频分析方法--基于经验的模式分解及希尔伯特变换谱,指出了该方法需进一步研究的有关问题     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011